home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group01a.txt
/
000067_icon-group-sender _Tue Jun 27 12:49:32 2000.msg
< prev
next >
Wrap
Internet Message Format
|
2002-01-03
|
1KB
Return-Path: <icon-group-sender>
Received: (from root@localhost)
by baskerville.CS.Arizona.EDU (8.9.1a/8.9.1) id MAA14033
for icon-group-addresses; Tue, 27 Jun 2000 12:49:15 -0700 (MST)
Message-Id: <200006271949.MAA14033@baskerville.CS.Arizona.EDU>
Date: Tue, 27 Jun 2000 10:31:35 -0700 (MST)
From: Gregg Townsend <gmt@baskerville.CS.Arizona.EDU>
To: Steve_Graham@labcorp.com, icon-group@optima.CS.Arizona.EDU
Subject: Re: Permutations/Combinations
Errors-To: icon-group-errors@optima.CS.Arizona.EDU
Status: RO
Content-Length: 907
From: "Steve Graham" <Steve_Graham@labcorp.com>
We have a brain teaser floating around work whose object is to find all
6-letter English words which can be made from the letters A, E, R, B,M
and L. I'm sure you can do this with Icon's reversible assignment,
but I don't understand the latter. Can anyone help me?
If you have a list of English words, an easy solution to the brain teaser
is to run the list through this filter:
procedure main()
local word
while word := read() do
if *word = 6 & cset(map(word)) == 'aerbml' then
write(word)
end
Of course, I have managed to avoid entirely your question about
reversible assignment.
---------------------------------------------------------------------------
Gregg Townsend Staff Scientist The University of Arizona
gmt@cs.arizona.edu Computer Science Tucson, Arizona, USA